package dptest;

public abstract class t746 {

	public static void main(String[] args) {
		int cost[] = {1,100,1,1,1,100,1,1,100,1};
		int dp [] = new int [cost.length+1];
		dp[0] = dp[1] = 0;
		for(int i =2; i<=cost.length;i++) {
			dp[i] = Math.min(dp[i-2]+cost[i-2], dp[i-1]+cost[i-1]);
		}
		//return dp[cost.length];
		//System.out.println(dp[cost.length]);

	}

}
